1023A - Single Wildcard Pattern Matching - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
long long aa[2000006];
long long bb[2000006];
long long cc[30];
pair<int,int>pp[200000];
vector<int>ww(20);
string ss[105];
map<string ,int >ff[2000];
int main()
{
int n,m;
cin>>n>>m;
string a,b;
cin>>a>>b;
int c=0,k=0,g=0;
for(int i=0;i<a.size();i++)if(a[i]=='*')g++;
if(!g&&a!=b)cout<<"NO"<<endl;
else if(!g&&a.size()!=b.size())cout<<"NO"<<endl;
else if(n>m&&n-m>1)cout<<"NO"<<endl;
else 
{

  for(int i=0;i<a.size();i++)
{
  if(a[i]=='*')break;
  if(a[i]!=b[k])
  {
    c=1;
    break;
  }
  k++;
}
int r=b.size()-1;
for(int j=a.size()-1;j>=0;j--)
{
  if(a[j]=='*')break;
  if(a[j]!=b[r])
  {
    c=1;
    break;
  }
  r--;
}
if(c)cout<<"NO"<<endl;
else cout<<"YES"<<endl;
}

}